Expressing Transactions with Savepoints as Non-Markovian Theories of Actions
نویسندگان
چکیده
Flat transactions with savepoints are a variation of the classical flat transactions that allows the user to go undo work done so far back to a certain point within the transaction. This is as opposed to pure classical flat transactions that either commit to whole work done so far or undo it. Recently, this mechanism is being offered by some major database products. Their semantics, however, seem not to be as well studied as the classical flat transactions. In this paper, we show how to use non-Markovian control in the situation calculus to capture flat transactions with savepoints. We also state some of their properties.
منابع مشابه
Towards a General Theory of Advanced Transaction Models in the Situation Calculus
We propose a theory for describing, reasoning about, and simulating transaction models that relax some of the ACID properties of classical transactions. Such models have been proposed for database applications involving long-lived, endless, and cooperative activities. Our approach appeals to non-Markovian theories, in which one may refer to past states other than the previous one. We illustrate...
متن کاملTowards a General Theory of Advanced Transaction Models in the Situation
We propose a theory for describing, reasoning about, and simulating transaction models that relax some of the ACID properties of classical transactions. Such models have been proposed for database applications involving long-lived, endless, and cooperative activities. Our approach appeals to non-Markovian theories, in which one may refer to past states other than the previous one. We illustrate...
متن کاملSimulation of Advanced Transaction Models Using GOLOG
We proposea logical framework for describing, reasoningabout, and simulating transaction models that relax some of the ACID (Atomicity-Consistency-Isolation-Durability) properties of classical transactions. Such extensions, usually called advanced transaction models (ATMs), have been proposed for dealing with new database applications involving long-lived, endless, and cooperative activities. O...
متن کاملAlan: An Action Language for Non-Markovian Domains
In this paper we present the syntax and semantics of a temporal action language named Alan. The language allows the specification of systems where the future state of the world depends not only on the current state, but also on the past states of the world, that is, where the Markov property does not hold. To the best of our knowledge, Alan is the first action language which incorporates causal...
متن کاملA Unifying Semantics for Active Databases Using Non-Markovian Theories of Actions
Over the last fifteen years, database management systems (DBMSs) have been enhanced by the addition of rule-based programming to obtain active DBMSs. One of the greatest challenges in this area is to formally account for all the aspects of active behavior using a uniform formalism. In this paper, we formalize active relational databases within the framework of the situation calculus by uniforml...
متن کامل